A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron
نویسندگان
چکیده
A minimum tetrahedralization of a convex polyhedron is a partition of the convex polyhedron with minimum number of tetrahedra. The problem of finding the minimum tetrahedralization of a convex polyhedron is known to be NP-Hard. In this paper, a genetic algorithm is presented to find an approximate solution to this problem. Our result always shows improvements to those produced by commonly used peeling and pulling methods.
منابع مشابه
Optimal Tetrahedralization of the 3d-Region between a Convex Polyhedron and a Convex Polygon
Given a convex polyhedron P and a convex polygon Q in ~3 such that Q's supporting plane does not intersect P, we are interested in tetrahedralizing the closure of the difference conve:c_hull(P U Q ) \ P; since P is convex, this difference is a connected nonconvex subset of T~ 3 which we call the region "between" P and Q. The problem is motivated by the work of Bern on tetrahedralizing the regio...
متن کاملBSP-Assisted Constrained Tetrahedralization
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them together. We generate a Binary Space Partition (BSP) tree from the triangular faces of a polyhedron and use this to identify the convex subpolyhedra in the polyhedron. Each convex subpolyhedron is tetrahedralized individ...
متن کاملOn Hamiltonian Tetrahedralizations Of Convex Polyhedra
Let Tp denote any tetrahedralization of a convex polyhedron P and let G be the dual graph of Tp such that each node of G T corresponds to a tetrahedron of Tp and two nodes are connected by an edge in G T if and only if the two corresponding tetrahedra share a common facet in Tp. Tp is called a Hamiltonian tetrahedralization if G contains a Hamiltonian path (HP). A wellknown open problem in comp...
متن کاملTetrahedralization of Simple and Non-Simple Polyhedra
It is known that not all simple polyhedra can be tetrahedralized, i.e., decomposed into a set of tetrahedra without adding new vertices (tetrahedralization). We investigate several classes of simple and non-simple polyhedra that admit such decompositions. In particular, we show that certain classes of rectilinear (isothetic) simple polyhedra can always be tetrahedralized in O(n2) time where n i...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کامل